Rigorous Approximation of Stationary Measures for Iterated Function Systems

نویسنده

  • ISAIA NISOLI
چکیده

We study the problem of the rigorous computation of the stationary measure of an IFS described by a stochastic mixture of two or more dynamical systems which are either all uniformly expanding on the interval, either all contractive. In the expanding case, the associated transfer operators satisfy a LasotaYorke inequality, and we compute rigorously the approximations in the L1 norm. The rigorous computation requires a computer-aided proof of the contraction of the transfer operators for the maps, and we show that this property propagates to the transfer operators of the IFS. In the contractive case we perform a rigorous approximation of the stationary measure in the Wasserstein-Kantorovich distance, using the same functional analytic approach. We show that a finite computation can produce a realistic computation of all contraction rates for the whole parameter space. We conclude with a description of the implementation and numerical experiments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rotation number and its properties for iterated function and non-autonomous systems  

The main purpose of this paper is to introduce the rotation number for non-autonomous and iterated function systems. First, we define iterated function systems and the lift of these types of systems on the unit circle. In the following, we define the rotation number and investigate the conditions of existence and uniqueness of this number for our systems. Then, the notions rotational entropy an...

متن کامل

Solving the Inverse Problem for Function / Image Approximation Using IFS

We are concerned with function approximation and image representation using Iterated Function Systems (IFS) over L p (X;): An N-map IFS with grey level maps (IFSM), to be denoted as (w;), is a set w of N contraction maps w i : X ! X over a compact metric space (X; d) (the \base space") with an associated set of maps i : R ! R. Associated with each IFSM is a contractive operator T with xed point...

متن کامل

Rigorous numerical Estimation of Lyapunov exponents and Invariant Measures of Iterated Function Systems and Random Matrix Products

We present a fast, simple matrix method of computing the unique invariant measure and associated Lyapunov exponents of a nonlinear iterated function system. Analytic bounds for the error in our approximate invariant measure (in terms of the Hutchinson metric) are provided, while convergence of the Lyapunov exponent estimates to the true value is assured. As a special case, we are able to rigoro...

متن کامل

Solving the Inverse Problem for Function and Image Approximation Using Iterated Function Systems

This paper is concerned with function approximation and image representation using a new formulation of Iterated Function Systems (IFS) over the general function spaces L p (X;): An N-map IFS with grey level maps (IFSM), to be denoted as (w;), is a set w of N contraction maps w i : X ! X over a compact metric space (X; d) (the \base space") with an associated set of maps i : R ! R. Associated w...

متن کامل

Absolute Continuity for Random Iterated Function Systems with Overlaps

We consider linear iterated function systems with a random multiplicative error on the real line. Our system is {x 7→ di + λiY x}i=1, where di ∈ R and λi > 0 are fixed and Y > 0 is a random variable with an absolutely continuous distribution. The iterated maps are applied randomly according to a stationary ergodic process, with the sequence of i.i.d. errors y1, y2, . . ., distributed as Y , ind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015